|
In mathematics, a binary operation on a set is a calculation that combines two elements of the set (called operands) to produce another element of the set (more formally, an operation whose arity is two, and whose two domains and one codomain are (subsets of) the same set). Examples include the familiar elementary arithmetic operations of addition, subtraction, multiplication and division. Other examples are readily found in different areas of mathematics, such as vector addition, matrix multiplication and conjugation in groups. ==Terminology== More precisely, a binary operation on a set ''S'' is a map which sends elements of the Cartesian product to ''S'': : Because the result of performing the operation on a pair of elements of ''S'' is again an element of ''S'', the operation is called a closed binary operation on ''S'' (or sometimes expressed as having the property of closure). If ''f'' is not a function, but is instead a partial function, it is called a partial binary operation. For instance, division of real numbers is a partial binary operation, because one can't divide by zero: ''a''/0 is not defined for any real ''a''. Note however that both in algebra and model theory the binary operations considered are defined on all of . Sometimes, especially in computer science, the term is used for any binary function. Binary operations are the keystone of algebraic structures studied in abstract algebra: they are essential in the definitions of groups, monoids, semigroups, rings, and more. Most generally, a ''magma'' is a set together with some binary operation defined on it. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「binary operation」の詳細全文を読む スポンサード リンク
|